Greedy distributed optimization of multi-commodity flows
نویسندگان
چکیده
منابع مشابه
Greedy Distributed Optimization of Multi-Commodity Flows Draft --- not for distribution
While multi-commodity flow is a classical combinatorial optimization problem, it also directly addresses a number of practically important issues of congestion and bandwidth management in connection-oriented network architectures. We consider solutions for distributed multi-commodity flow problems, which are solved by multiple agents operating in a cooperative but uncoordinated manner. We provi...
متن کاملAugmenting flows for the consistent migration of multi-commodity single-destination flows in SDNs
Updating network flows in a real-world setting is a nascent research area, especially with the recent rise of Software Defined Networks. While augmenting s-t flows of a single commodity is a well-understood concept, we study updating flows in a multi-commodity setting: Given a directed network with flows of different commodities, how can the capacity of some commodities be increased, without re...
متن کاملsolution of security constrained unit commitment problem by a new multi-objective optimization method
چکیده-پخش بار بهینه به عنوان یکی از ابزار زیر بنایی برای تحلیل سیستم های قدرت پیچیده ،برای مدت طولانی مورد بررسی قرار گرفته است.پخش بار بهینه توابع هدف یک سیستم قدرت از جمله تابع هزینه سوخت ،آلودگی ،تلفات را بهینه می کند،و هم زمان قیود سیستم قدرت را نیز برآورده می کند.در کلی ترین حالتopf یک مساله بهینه سازی غیر خطی ،غیر محدب،مقیاس بزرگ،و ایستا می باشد که می تواند شامل متغیرهای کنترلی پیوسته و گ...
Distributed Optimization in DTNs: Towards Understanding Greedy and Stochastic Algorithms
Opportunistic or Delay Tolerant Networks is a new networking paradigm that is envisioned to complement existing wireless technologies (cellular, WiFi) by exploiting a “niche” performance-cost tradeoff. Wireless peers communicate when in contact, forming a network “on the fly” whose connectivity graph is highly dynamic and only partially connected. This gives rise to a number of challenging opti...
متن کاملEfficient Online Multi-robot Exploration via Distributed Sequential Greedy Assignment
This work addresses the problem of efficient online exploration and mapping using multi-robot teams via a distributed algorithm for planning for multi-robot exploration— distributed sequential greedy assignment (DSGA)—based on the sequential greedy assignment (SGA) algorithm. SGA permits bounds on suboptimality but requires all robots to plan in series. Rather than plan for robots sequentially ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Distributed Computing
سال: 2008
ISSN: 0178-2770,1432-0452
DOI: 10.1007/s00446-008-0074-0